Bending and stress analysis of polymeric composite plates reinforced with functionally graded graphene platelets based on sinusoidal shear-deformation plate theory

The bending and stress analysis of a functionally graded polymer composite plate reinforced with gra-phene platelets are studied in this paper. The governing equations are derived by using principle of virtual work for a plate which is rested on Pasternak's foundation. Sinusoidal shear deformation theory is used to describe displacementfield. Four different distribution patterns are employed in our analysis. The analytical solution is presented for a functionally graded plate to investigate the influence of important parameters. The numerical results are presented to show the deflection and stress results of the problem for four employed patterns in terms of geometric parameters such as number of layers, weight fraction and two parameters of Pasternak's foundation.     

The joint signature of coherent systems

We investigate the joint signature of $m$ coherent systems, under the assumption that the components have independent and identically distributed lifetimes. The joint signature, for a particular ordering of failure times, is an $m$‐dimensional matrix depending solely on the composition of the systems and independent of the underlying distribution function of the component lifetimes. The elements of the $m$‐dimensional matrix are formulated based on the joint signatures of numerous series of parallel systems. The number of the joint signatures involved is an exponential function of the number of the minimal cut sets of each original system and may, therefore, be significantly large. We prove that although this number is typically large, a great number of the joint signatures are repeated, or removed by negative signs. We determine the maximum number of different joint signatures based on the number of systems and components. It is independent of the number of the minimal cut sets of each system and is polynomial in the number of components. Moreover, we consider all permutations of failure times and demonstrate that the results for one permutation can be of use for the others. Our theorems are applied to various examples. The main conclusion is that the joint signature can be computed much faster than expected.